Optimal admissible composition of abstraction heuristics
نویسندگان
چکیده
منابع مشابه
Optimal Additive Composition of Abstraction-based Admissible Heuristics
We describe a procedure that takes a classical planning task, a forward-search state, and a set of abstraction-based admissible heuristics, and derives an optimal additive composition of these heuristics with respect to the given state. Most importantly, we show that this procedure is polynomial-time for arbitrary sets of all known to us abstraction-based heuristics such as PDBs, constrained PD...
متن کاملAdmissible Heuristics for Optimal Planning
tlSP ~tm[ HSPr iLrt~ two r(’¢’Pllt p].allllors th~tt st.,trch th," statt~-Sl);.’," 1tsiltg i).lt heuristic fl|n,’tiolt (’xtt’act,’,l froill Strips cnt’tMiatgs, liSP dot’s a f(,rward s(mrch frtmt the ialt.bd stlttt, rt:vc,tuputiltg tim Imuristic in vv(.ry static. whih: HSPr tit)its a l’t:grt.ssit,u s(.~Lr0’h fl’cJm th(. g0,:tl t’,,utpuling ~t .-uitalth. r(.prv.~vtttati,)u -f th(. h,.,trim.it .nl...
متن کاملGenerating Admissible Heuristics by Abstraction for Search in Stochastic Domains
Search in abstract spaces has been shown to produce useful admissible heuristic estimates in deterministic domains. We show in this paper how to generalize these results to search in stochastic domains. Solving stochastic optimization problems is significantly harder than solving their deterministic counterparts. Designing admissible heuristics for stochastic domains is also much harder. Theref...
متن کاملFlexible Abstraction Heuristics for Optimal Sequential Planning
We describe an approach to deriving consistent heuristics for automated planning, based on explicit search in abstract state spaces. The key to managing complexity is interleaving composition of abstractions over different sets of state variables with abstraction of the partial composites. The approach is very general and can be instantiated in many different ways by following different abstrac...
متن کاملImplicit abstraction heuristics for cost-optimal planning
State-space search with explicit abstraction heuristics is at the state of the art of cost-optimal planning. These heuristics are inherently limited nonetheless, because the size of the abstract space must be bounded by some, even if very large, constant. Targeting this shortcoming, we introduce the notion of (additive) implicit abstractions, in which the planning task is abstracted by instance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2010
ISSN: 0004-3702
DOI: 10.1016/j.artint.2010.04.021